On the tree search problem with non-uniform costs
نویسندگان
چکیده
منابع مشابه
On the Tree Search Problem with Non-uniform Costs
Searching in partially ordered structures has been considered in the context of information retrieval and efficient tree-like indexes, as well as in hierarchy based knowledge representation. In this paper we focus on tree-like partial orders and consider the problem of identifying an initially unknown vertex in a tree by asking edge queries: an edge query e returns the component of T − e contai...
متن کاملStochastic Steiner Tree with Non-uniform Inflation
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this problem. In this problem, we are given a graph G = (V,E), with each edge having two costs cM and cT (the costs for Monday and Tuesday, respectively). We are also given a probability distribution π : 2 → [0, 1] over subs...
متن کاملThe non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking
This paper considers the Bounded Degree Minimum Diameter Spanning Tree problem (BDST problem) with non-uniform degree bounds. In this problem, we are given a metric length function ` over a set V of n nodes and a degree bound Bv for each v ∈ V , and want to find a spanning tree with minimum diameter such that each node v has degree at most Bv. We present a simple extension of an O( √ log n)-app...
متن کاملTabu search for the linear ordering problem with cumulative costs
Given a matrix of weights, the Linear Ordering Problem (LOP) consists of finding a permutation of the columns and rows in order to maximize the sum of the weights in the upper triangle. This well known NP-complete problem can also be formulated on a complete weighted graph, where the objective is to find an acyclic tournament that maximizes the sum of arc weights. The variant of the LOP that we...
متن کاملThe Non-Uniform k-Center Problem
In this paper, we introduce and study the Non-Uniform k-Center (NUkC) problem. Given a finite metric space (X, d) and a collection of balls of radii {r1 ≥ · · · ≥ rk}, the NUkC problem is to find a placement of their centers on the metric space and find the minimum dilation α, such that the union of balls of radius α · ri around the ith center covers all the points in X . This problem naturally...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.07.019